Jeffrey Ullman - PDFSEARCH.IO - Document Search Engine

Jeffrey Ullman
Results: 29

#	Item
21	Upper and Lower Bounds on the Cost of a Map-Reduce Computation ∗ Foto N. Afrati† , Anish Das Sarma] , Semih Salihoglu‡ , Jeffrey D. Ullman‡ National Technical University of Athens, ] Google Research, ‡ Stanford Add to Reading List Source URL: www.vldb.org Language: English - Date: 2013-04-25 03:37:48 Quantum complexity theory Distributed computing architecture MapReduce Parallel computing Computational complexity theory PP Coding theory Algorithm Function Mathematics Theoretical computer science Applied mathematics
22	Optimizing Joins in a Map-Reduce Environment Foto N. Afrati Jeffrey D. Ullman National Technical University of Athens,Greece Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2009-09-14 16:39:17 Database theory Relational database Relation Function Tuple Finitary relation Vector space Relational algebra Mathematics Algebra Relational model
23	A New Computation Model for Cluster Computing Foto N. Afrati∗, and Jeffrey D. Ullman† December 30, 2009 Abstract Implementations of map-reduce are being used to perform many operations on very large Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2009-12-30 16:05:05 Computing Bitonic sorter Algorithm External sorting Merge sort Quicksort Sorting network Randomized algorithm MapReduce Sorting algorithms Mathematics Order theory
24	Aditya Parameswaran Department of Computer Science University of Illinois, Urbana-Champaign Urbana IL[removed]Employment Add to Reading List Source URL: www-cs-students.stanford.edu Language: English - Date: 2014-06-11 13:13:30 VLDB Data management Academia Jeffrey Ullman Jennifer Widom Héctor García-Molina Conference on Innovative Data Systems Research SIGMOD Alon Y. Halevy Guggenheim Fellows Computer science Computing
25	Experiments as Research Validation – Have We Gone too Far? Jeffrey D. Ullman, July 9, 2013 I recently submitted a paper to VLDB, and when I got the reviews back, I noticed that the review form now has a question refere Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2013-07-09 20:51:24 Sorting algorithms Computational complexity theory Analysis of algorithms Algorithm Mathematical logic Bubble sort Time complexity MapReduce Quicksort Theoretical computer science Mathematics Applied mathematics
26	In memory of Seymour Ginsburg 1928 – 2004 Seymour Ginsburg, a pioneer of formal language theory and database theory, passed Add to Reading List Source URL: www.sigmod.org Language: English - Date: 2012-08-10 21:10:45 Mathematical sciences Computer science Abstract family of languages Ginsberg Serge Abiteboul Jurassic Bark Jeffrey Ullman Science Guggenheim Fellows Seymour Ginsburg Sheila Greibach
27	PDF Document Add to Reading List Source URL: www.ieee.org Language: English Year of birth missing Turing Award laureates Barbara Jane Liskov Susan L. Graham David Patterson Jeffrey Ullman Yale Patt Edward J. McCluskey John von Neumann Science Computing Academia
28	PDF Document Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2011-07-12 18:43:57 Seymour Ginsburg Computer science Computing Alfred Aho Jeffrey Ullman Year of birth missing Guggenheim Fellows Academia John Hopcroft
29	PDF Document Add to Reading List Source URL: garfield.library.upenn.edu Language: English - Date: 2003-11-17 13:09:17 Mathematics John Hopcroft Introduction to Automata Theory Languages and Computation Automata theory Jeffrey Ullman Alfred Aho Formal languages Computer science Theoretical computer science